Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization

نویسندگان

  • Khan Wahid
  • Vassil S. Dimitrov
  • Graham A. Jullien
چکیده

previously published scalar quantization algorithm [3], This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a new algebraic integer quantization of a 1-D radix-8 DCT that allows the separable computation of a 2D DCT without any intermediate number representation conversions. This is a considerable improvement on previously introduced algebraic integer encoding techniques to compute both DCT and IDCT which eliminates the requirements to approximate the transformation matrix elements by obtaining their exact representations and hence mapping the transcendental functions without any errors. Using this encoding scheme, an entire 1-D DCT-SQ (scalar quantization) algorithm can be implemented with only 24 adders. Apart from the multiplicationfree nature, this new mapping scheme fits to this algorithm, eliminating any computational or quantization errors and resulting short-word-length and high-speed-design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplierless Dct Algorithm for Image Compression Applications

Abstract: This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of 8x8 2-D Discrete Cosine Transform. The architecture uses a new algebraic integer encoding of a 1-D radix-8 DCT that allows the separable computation of a 2-D 8x8 DCT without any intermediate number representation conversions. This is a considerable improvement on previously introduc...

متن کامل

An efficient technique for error-free algebraic-integer encoding for high performance implementation of the DCT and IDCT

ABSTRACT A recently introduced algebraic integer encoding scheme allows low complexity, virtually error free computation of the DCT and IDCT. Efficiencies can be introduced into this method, but at the expense of some increase in error. In this paper, a modification to the encoding scheme is introduced for specific architectures which provides increased implementation efficiency, but with no sa...

متن کامل

Systematic Approach of Fixed Point 8x8 IDCT and DCT Design and Implementation

MPEG has recently issued a CFP for voluntary fixed point 8x8 IDCT and DCT standards to ease the effort that is needed to implement the IDCT and DCT, and also to help ensure that decoders are implemented in conformance with the MPEG standard. This paper is conclusion and extension of our previous proposal responding to the CFP. A systematic approach of fixed point 8x8 IDCT and DCT design and imp...

متن کامل

A Row-Parallel 8 × 8 2-D DCT Architecture Using Algebraic Integer-Based Exact Computation

An algebraic integer (AI) based time-multiplexed row-parallel architecture and two final-reconstruction step (FRS) algorithms are proposed for the implementation of bivariate AI-encoded 2-D discrete cosine transform (DCT). The architecture directly realizes an error-free 2-D DCT without using FRSs between row-column transforms, leading to an 8×8 2-D DCT which is entirely free of quantization er...

متن کامل

Variable Length Reconfigurable Algorithms and Architectures for DCT/IDCT Based on Modified Unfolded Cordic

Abstract: A coordinate rotation digital computer (CORDIC) based variable length reconfigurable DCT/IDCT algorithm and corresponding architecture are proposed. The proposed algorithm is easily to extend to the 2-point DCT/IDCT. Furthermore, we can easily construct the N-point DCT/IDCT with two N/2-pt DCTs/IDCTs based the proposed algorithm. The architecture based on the proposed algorithm can su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005